A formalization of programs in first-order logic with a discrete linear order
نویسندگان
چکیده
منابع مشابه
A Formalization of Programs in First-Order Logic with a Discrete Linear Order
We consider the problem of representing and reasoning about computer programs, and propose a translator from a core procedural iterative programming language to first-order logic with quantification over the domain of natural numbers that includes the usual successor function and the “less than” linear order, essentially a first-order logic with a discrete linear order. Unlike Hoare’s logic, ou...
متن کاملFirst Order Logic, Fixed Point Logic and Linear Order
The Ordered conjecture of Kolaitis and Vardi asks whether xed point logic di ers from rst order logic on every in nite class of nite ordered structures In this paper we develop the tool of bounded variable element types and illustrate its application to this and the orig inal conjectures of McColm which arose from the study of inductive de nability and in nitary logic on pro cient classes of ni...
متن کاملTranslating First-Order Theories into Logic Programs
This paper focuses on computing first-order theories under either stable model semantics or circumscription. A reduction from first-order theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics is also given. Having such reduction and embedding, reasoning problems represented by first-order theor...
متن کاملA progression semantics for first-order logic programs
In this paper, we propose a progression semantics for first-order normal logic programs, and show that it is equivalent to the well-known stable model (answer set) semantics. The progressional definition sheds new insights into Answer Set Programming (ASP), for instance, its relationships to Datalog, First-Order Logic (FOL) and Satisfiability Modulo Theories (SMT). As an example, we extend the ...
متن کاملA tabulation procedure for first-order residuated logic programs
Residuated logic programs have shown to be a generalisation of a number of approaches to logic programming under uncertainty. Regarding automated deduction, a tabulation procedure was recently introduced for the propositional version. In this paper, we introduce a sound and complete tabulation-based proof procedure for the first-order extension of residuated logic programs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2016
ISSN: 0004-3702
DOI: 10.1016/j.artint.2016.01.014